Penalty Function Approach for Constrained Convolutive Blind Source Separation
نویسندگان
چکیده
A new approach for convolutive blind source separation (BSS) using penalty functions is proposed in this paper. Motivated by nonlinear programming techniques for the constrained optimization problem, it converts the convolutive BSS into a joint diagonalization problem with unconstrained optimization. Theoretical analyses together with numerical evaluations reveal that the proposed method not only improves the separation performance by significantly reducing the effect of large errors within the elements of covariance matrices at low frequency bins and removes the degenerate solution induced by a null unmixing matrix, but also provides an unified framework to constrained BSS.
منابع مشابه
A Joint Diagonalization Method for Convolutive Blind Separation of Nonstationary Sources in the Frequency Domain
A joint diagonalization algorithm for convolutive blind source separation by explicitly exploiting the nonstationarity and second order statistics of signals is proposed. The algorithm incorporates a non-unitary penalty term within the cross-power spectrum based cost function in the frequency domain. This leads to a modification of the search direction of the gradient-based descent algorithm an...
متن کاملA probabilistic approach for blind source separation of underdetermined convolutive mixtures
There are very few techniques that can separate signals from the convolutive mixture in the underdetermined case. We have developed a method that uses overcomplete expansion of the signal created with a time-frequency transform and that also uses the property of sparseness and a Laplacian source density model to obtain the source signals from the instantaneously mixed signals in the underderdet...
متن کاملBlind Signal Separation of Convolutive Mixtures: A Time-Domain Joint-Diagonalization Approach
We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary and possibly also non-white. The proposed algorithm is based on a joint-diagonalization approach, where we search for a single polynomial matrix that jointly diagonalizes a set of measured spatiotemporal correlation ma...
متن کاملBlind Source Separation of Convolutive Mixtures of Speech in Frequency Domain
This paper overviews a total solution for frequencydomain blind source separation (BSS) of convolutive mixtures of audio signals, especially speech. Frequency-domain BSS performs independent component analysis (ICA) in each frequency bin, and this is more efficient than time-domain BSS. We describe a sophisticated total solution for frequency-domain BSS, including permutation, scaling, circular...
متن کاملA general approach for mutual information minimization and its application to blind source separation
In this paper, a non-parametric “gradient” of the mutual information is first introduced. It is used for showing that mutual information has no local minima. Using the introduced “gradient”, two general gradient based approaches for minimizing mutual information in a parametric model are then presented. These approaches are quite general, and principally they can be used in any mutual informati...
متن کامل